Automatic presentations for semigroups

نویسندگان

  • Alan J. Cain
  • Graham P. Oliver
  • Nikola Ruskuc
  • Richard M. Thomas
چکیده

This paper applies the concept of FA-presentable structures to semigroups. We give a complete classification of the finitely generated FA-presentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FA-presentable. We give a complete list of FA-presentable one-relation semigroups and compare the classes of FA-presentable semigroups and automatic semigroups.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unary FA-Presentable Semigroups

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of interesting decision problems. A particular focus of research has been the classification of those structures of some species that admit automatic presentations. Whilst some successes have been obtained, this appears to be a difficult pro...

متن کامل

Presentations for Subsemigroups of Groups

This thesis studies subsemigroups of groups from three perspectives: automatic structures, ordinary semigroup presentations, and Malcev presentaions. [A Malcev presentation is a presentation of a special type for a semigroup that can be embedded into a group. A group-embeddable semigroup is Malcev coherent if all of its finitely generated subsemigroups admit finite Malcev presentations.] The th...

متن کامل

Automatic structures for subsemigroups of Baumslag–Solitar semigroups

This paper studies automatic structures for subsemigroups of Baumslag–Solitar semigroups (that is, semigroups presented by ⟨x, y | (yx, xy)⟩ where m,n ∈ N). A geometric argument (a rarity in the field of automatic semigroups) is used to show that if m > n, all of the finitely generated subsemigroups of this semigroup are [right-] automatic. If m < n, all of its finitely generated subsemigroups ...

متن کامل

Automatic Presentations for Cancellative Semigroups

This paper studies FA-presentable structures and gives a complete classification of the finitely generated FA-presentable cancellative semigroups. We show that a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group.

متن کامل

Malcev Presentations for Subsemigroups of Groups — a Survey

This paper introduces and surveys the theory of Malcev presentations. [Malcev presentations are a species of presentation that can be used to define any semigroup that can be embedded into a group.] In particular, various classes of groups and monoids all of whose finitely generated subsemigroups admit finite Malcev presentations are described; closure and containment results are stated; links ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Comput.

دوره 207  شماره 

صفحات  -

تاریخ انتشار 2009